Applications of finite geometries to information security

Many problems in information security can be resolved using combinatorial structures, primarily geometries. In fact, often the most efficient solutions kn'awn are provided by schemes based on geometries. In this expository article we look at two problems in information security and discuss proposed geometrical solutions. In addition, we generalise two known constructions for Key Distribution Patterns, using Laguerre planes. The generalisation has the potential to provide new examples of Key Distribution Patterns, as well as simplifying the proofs of the constructions considerably.